A Rule-Based Optimizer for Spatial Join Algorithms
نویسندگان
چکیده
The spatial join operation is both one of the most important and expensive operations in Geographic Database Management Systems (GDBMS). This paper presents a set of rules to optimize the performance of the filtering step of spatial joins operations. First, a set of expressions to predict the number of I/O operations and CPU performance is presented. The rules are based on expressions to predict the performance of algorithms and tests performed with synthetic and real data sets. Fos some cases, the optimized algorithm can execute the same operation 10 times faster than the original, non-optimized version.
منابع مشابه
Gator: An Optimized Discrimination Network for Active Database Rule Condition Testing
This paper introduces a new discrimination network structure called Gator that is a generalization of the widely known Rete and TREAT algorithms. Gator can be used as a replacement for Rete or TREAT in active database rule systems and production system interpreters. In Gator,-memory nodes that hold intermediate join results can have two or more inputs, not exactly two inputs as they do in Rete....
متن کاملOn the Estimation of Join Result Sizes
Good estimates of join result sizes are critical for query optimization in relational database management systems. We address the problem of incrementally obtaining accurate and consistent estimates of join result sizes. We have invented a new rule for choosing join selectivities for estimating join result sizes. The rule is part of a new unified algorithm called Algorithm ELS (Equivalence and ...
متن کاملPartition Based Path Join Algorithms for XML Data
Path expression is an important component in querying XML data. The extended preorder numbering scheme enables us to quickly determine the ancestor-descendant relationship between elements in the hierarchy of XML data. Using the numbering scheme, a path expression can be evaluated by join operations to avoid potentially high cost of tree traversals. In this paper, we first formulate XML path qu...
متن کاملOpt++ : an Object{oriented Implementation for Extensible Database Query Optimization Paper Number 323
classes. In this section, we describe how the various operator trees and access plans are generated by the search strategy during the course of optimization. 3.3.1 The TreeToTreeGenerator Class Classes derived from the TreeToTreeGenerator abstract class are used to generate various operator trees. These classes have a virtual method called Apply that takes an existing operator tree and creates ...
متن کاملFramework-Based Development and Evaluation of Cost-Based Native XML Query Optimization Techniques
Reflecting on the history of database management systems reveals that cost-based query optimization has been the dominating method for effectively answering complex queries on large documents. Native XML database management systems provide an efficient infrastructure for storing, indexing, and querying large XML documents. Even though such systems can choose from a huge set of structural join o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006